Strong Cut-Elimination for Constant Domain First-Order S5
نویسنده
چکیده
We consider a labelled tableau presentation of constant domain rst-order S5 and prove a strong cut-elimination theorem.
منابع مشابه
Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjoys cut-elimination, we obtain a cut-elimination theorem for all corresponding CoS calculi. We then show how our result leads to a minimal cut-free CoS calculus for modal logic S5. No other existing CoS calculi for S5 e...
متن کاملClassical Gentzen-Type Methods in Propositional Many-Valued Logics
A classical Gentzen-type system is one which employs two-sided sequents, together with structural and logical rules of a certain characteristic form. A decent Gentzentype system should allow for direct proofs, which means that it should admit some useful forms of cut elimination and the subformula property. In this tutorial we explain the main difficulty in developing classical Gentzen-type sys...
متن کامل0 N ov 2 01 7 A Cut - free sequent calculus for modal logic S 5 ∗ †
Providing a cut-free sequent calculus for S5 has a long history. The efforts in this direction are numerous, and each of them presents some difficulties. In this paper, we present a sequent calculus system for modal logic S5. It has in a sense subformula property. We show that the cut rule is admissible in this system.
متن کاملModel Theory 290B: Interpolation in Classic Predicate Logic and Quantified Modal Logic S5(S5B)
Interpolation theorem has an important role in classic predicate logic. Two prominent applications are Robinson’s joint consistency theorem and Beth’s definability theorem (though both were proved originally in different ways). It also have close relation to cut-elimination of sequent calculus. However, interpolation theorem fails in quantified modal logic S5 and related extensions. In this ter...
متن کاملFMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends
A converter from first-order modal logics to classical higherorder logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within firstorder modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 3 شماره
صفحات -
تاریخ انتشار 1995